Secure ElGamal-Type Cryptosystems Without Message Encoding
نویسنده
چکیده
ElGamal cryptosystem is one of the oldest public-key cryptosystems. It is known to be semantically secure for arbitrary messages in the random oracle model under the decisional Diffie-Hellman assumption. Semantic security also holds in the standard model when messages are encoded as elements in the group for which the decisional Diffie-Hellman assumption is defined. This paper introduces a setting and companion cryptosystem where semantic security can be proved in the standard model without message encoding. Extensions achieving security against chosen-ciphertext attacks are also provided.
منابع مشابه
Comparison of two Public Key Cryptosystems
Since the time public-key cryptography was introduced by Diffie andHellman in 1976, numerous public-key algorithms have been proposed. Some of thesealgorithms are insecure and the others that seem secure, many are impractical, eitherthey have too large keys or the cipher text they produce is much longer than theplaintext. This paper focuses on efficient implementation and analysis of two mostpo...
متن کاملEncoding-Free ElGamal-Type Encryption Schemes on Elliptic Curves
At PKC 2006, Chevallier-Mames, Paillier, and Pointcheval proposed a very elegant technique over cyclic subgroups of Fp eliminating the need to encode the message as a group element in the ElGamal encryption scheme. Unfortunately, it is unclear how to adapt their scheme over elliptic curves. In a previous attempt, Virat suggested an adaptation of ElGamal to elliptic curves over the ring of dual ...
متن کاملAdaptively Secure Threshold Cryptography without the Assumption of Erasure
We exhibit eecient threshold cryptosystems which are secure against adaptive adversaries even when the players cannot erase their local data. Speciically, we present erasure-free adaptively-secure protocols for distributed decryption in Cramer-Shoup cryptosystem. Our techniques are also applicable for distributing the secret-key operation of other cryptosystems, like RSA, DSS, and ElGamal, as w...
متن کاملNew Computation Technique for Encryption and Decryption Based on Rsa and Elgamal Cryptosystems
Cryptography addresses the necessary elements for secure communication that involved privacy, confidentiality, key exchange, authentication, and non-repudiation. This paper proposed a new computation of encryption and decryption that was based on the computation of RSA and ElGamal Cryptosystems. The RSA is a public key encryption system that gets its security from the difficulty of factoring la...
متن کاملSecurity of Discrete Log Cryptosystems in theRandom Oracle + Generic ModelClaus
Based on a novel proof model we prove security for simple discrete log cryptosystems for which security has been an open problem. We consider a combination of the random oracle (RO) model and the generic model. This corresponds to assuming an ideal hash function H given by an oracle and an ideal group of prime order q, where the binary encoding of the group elements is useless for cryptographic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016